Subtree - Counting
نویسنده
چکیده
منابع مشابه
EvoMiner: Frequent Subtree Mining in Phylogenetic Databases Technical Report #11-08, Dept. of Computer Science, Iowa State University
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to make sense of the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic trees. EvoMiner is an Apriori-like le...
متن کاملMethod for Extracting Valuable Common Structures from Heterogeneous Rooted and Labeled Tree Data
The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns. Because mining frequent tree patterns has a wide range of applications such as XML mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms su...
متن کاملCounting Problems and the Inclusion-Exclusion Principle
In this paper, we present improved techniques for computing and getting bounds on the cardinality of a union of sets using the inclusion-exclusion principle and Bonferroni inequalities. We organize the terms involved in the inclusionexclusion sum as a tree, showing that a set inclusion between a parent and its children yields a cancellation, where we may prune an entire subtree. Next, we provid...
متن کاملCounting Solutions of Integer Programs Using Unrestricted Subtree Detection
In the recent years there has been tremendous progress in the development of algorithms to find optimal solutions for integer programs. In many applications it is, however, desirable (or even necessary) to generate all feasible solutions. Examples arise in the areas of hardware and software verification and discrete geometry. In this paper, we investigate how to extend branch-and-cut integer pr...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کامل